Improved Adaptive Differential Evolution Algorithm for the Un-Capacitated Facility Location Problem
نویسندگان
چکیده
The differential evolution algorithm is an evolutionary for global optimization and the un-capacitated facility location problem (UFL) one of classic NP-Hard problems. In this paper, combined with specific characteristics UFL problem, we introduce activation function to solving name it improved adaptive (IADEA). Next, improve efficiency alleviate being stuck in a local optimum, operator was added. To test improvement our algorithm, compare IADEA basic by typical instances respectively. Moreover, other heuristic use hybrid ant colony solve same instances. computational results show that improves performance DE outperforms algorithm.
منابع مشابه
Improved approximation of the general soft-capacitated facility location problem
The Soft-Capacitated Facility Location Problem, where each facility is composed of a variable number of fixed-capacity production units, has been recently studied in several papers, especially in the metric case. In this paper, we only consider the general problem where connection costs do not systematically satisfy the triangle inequality property. We show that an adaptation of the set coverin...
متن کاملApproximation algorithm for k-level hard capacitated facility location problem
In this paper, we consider k-level hard capacitated facility location problem.
متن کاملAn improved cut-and-solve algorithm for the single-source capacitated facility location problem
In this paper we present an improved cut–and–solve algorithm for the single– source capacitated facility location problem. The algorithm consists of three phases. The first phase strengthens the integer program by a cutting plane algorithm to obtain a tight lower bound. The second phase uses a two level local branching heuristic to find an upper bound and, if optimality has not yet been establi...
متن کاملDifferential Evolution Solution for Single Source Capacitated Facility Location Allocation Problem
Facility location allocation problem is a very important issue in today's global logistic management. Various facility location problems have been considered in operations research under somehow stringent conditions to reduce the search space. In this paper, we consider a class of single source capacitated facility location allocation problems that can assume more realistic conditions in real l...
متن کاملThe Capacitated Mobile Facility Location Problem
The capacitated mobile facility location problem (CMFLP) arises in logistics planning of community outreach programs delivered via mobile facilities. It adds capacity restrictions to the mobile facility location problem introduced previously by Demaine et al. [2009], thereby extending the problem to a practical setting. In the problem, one seeks to relocate (or move) a set of existing facilitie...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Open Journal of Applied Sciences
سال: 2023
ISSN: ['2165-3917', '2165-3925']
DOI: https://doi.org/10.4236/ojapps.2023.135054